Least Squares Approximation by One-Pass Methods with Piecewise Polynomials
نویسنده
چکیده
We propose several one-pass methods for data fitting in which a piecewise polynomial is used as an approximating function. The polynomial pieces are calculated step-by-step by the method of least squares as the data is -----------,scaIIIIed umy-once-from the begimring La tIre end. To calculate the least squares fitting in each step, we use three classes of data, namely: the data in the current interval for which we want to determine the approximation, the data on the right side of this interval, and the data on the left side of this interval. The stability of the proposed algorithms is analyzed, and it is shown that a stable algorithm is obtained for all the one-pass methods proposed here.
منابع مشابه
Numerical solution of the spread of infectious diseases mathematical model based on shifted Bernstein polynomials
The Volterra delay integral equations have numerous applications in various branches of science, including biology, ecology, physics and modeling of engineering and natural sciences. In many cases, it is difficult to obtain analytical solutions of these equations. So, numerical methods as an efficient approximation method for solving Volterra delay integral equations are of interest to many res...
متن کاملCollocation - A Simple, Flexible and Efficient Method for Integral and Differential Equations
We present a collocatIon method based on piecewise cubic polynomials I In C for solving various Integral and differential equatIons. Two new methods for handling curved boundaries are discussed based on collocation and discrete least-squares. Finally, a summary of the properties of the collocation method Is given which IndIcates the simplicity, flexlbl1fty, efficiency, and generality of the met...
متن کاملReference points based transformation and approximation
Interpolating and approximating polynomials have been living separately more than two centuries. Our aim is to propose a general parametric regression model that incorporates both interpolation and approximation. The paper introduces first a new r-point transformation that yields a function with a simpler geometrical structure than the original function. It uses r ≥ 2 reference points and decre...
متن کاملLeast-Squares Galerkin Methods for Parabolic Problems I: Semidiscretization in Time
This is the rst part of a series of papers on least-squares Galerkin methods for parabolic initial-boundary value problems. These methods are based on the minimization of a least-squares functional for an equivalent rst-order system over space and time with respect to suitable discrete spaces. This paper presents the derivation and analysis of one-step methods for semi-discretization in time fr...
متن کاملUniversal algorithms for learning theory Part II : piecewise polynomial functions
This paper is concerned with estimating the regression function fρ in supervised learning by utilizing piecewise polynomial approximations on adaptively generated partitions. The main point of interest is algorithms that with high probability are optimal in terms of the least square error achieved for a given number m of observed data. In a previous paper [1], we have developed for each β > 0 a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013